Super-fast validated solution of linear systems
نویسندگان
چکیده
منابع مشابه
Super-fast Validated Solution of Linear Systems
Validated solution of a problem means to compute error bounds for a solution in finite precision. This includes the proof of existence of a solution. The computed error bounds are to be correct including all possible effects of rounding errors. The fastest known validation algorithm for the solution of a system of linear equations requires twice the computing time of a standard (purely) numeric...
متن کاملValidated Solution of Large Linear Systems
Some new methods will be presented for computing verified inclusions of the solution of large linear systems. The matrix of the linear system is typically of band or sparse structure. There are no prerequisites to the matrix such as being M-matrix, symmetric, positive definite or diagonally dominant. For general band matrices of lower, upper bandwidth p, q of dimension n the computing time is l...
متن کاملMinimal solution of fuzzy linear systems
In this paper, we use parametric form of fuzzy number and we converta fuzzy linear system to two linear system in crisp case. Conditions for the existence of a minimal solution to $mtimes n$ fuzzy linear equation systems are derived and a numerical procedure for calculating the minimal solution is designed. Numerical examples are presented to illustrate the proposed method.
متن کاملFast and Efficient Parallel Solution of Dense Linear Systems
The most efficient previously known parallel algorithms for the inversion ofa nonsingular n x n matrix A or solving a linear system Ax = b over the rational numbers require O(log2n) time and M(n).~ processors [provided that M(n) processors suffice in order to multiply two n × n rational matrices in time O (log n)]. Furthermore, the known polylog arithmetic time algorithms for those problems are...
متن کاملFast and Efficient Parallel Solution of Sparse Linear Systems
This paper presents a parallel algorithm for the solution of a linear system Ax = b with a sparse n n symmetric positive deenite matrix A, associated with the graph G(A) that has n vertices and has an edge for each nonzero entry of A. If G(A) has an s(n)-separator family and a known s(n)-separator tree, then the algorithm requires only O(log 3 n) time and (jEj+M(s(n)))= log n processors for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2007
ISSN: 0377-0427
DOI: 10.1016/j.cam.2005.07.038